Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set
نویسندگان
چکیده
منابع مشابه
Shuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملShuffled frog leaping algorithm based on enhanced learning
The paper proposes shuffled frog leaping algorithm (SFLA) based on enhanced learning, which generates a virtual general centre frog that is related to the optimal frog of each memeplex. The algorithm can utilise the superior information of each memeplex, enhance the mutual learning and use the average centre of optimal frog. In the processing of evolution, the optimal frog of sub-memeplex learn...
متن کاملCentroid Mutation Embedded Shuffled Frog-Leaping Algorithm
Stochastic search algorithms that take their inspiration from nature are gaining a great attention of many researchers to solve high dimension and non – linear complex optimization problems for which traditional methods fails. Shuffled frog – leaping algorithm (SFLA) is recent addition to the family of stochastic search algorithms that take its inspiration from the foraging process of frogs. SF...
متن کاملAn Improved Shuffled Frog Leaping Algorithm ⋆
In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...
متن کاملTwo-Phases Learning Shuffled Frog Leaping Algorithm
In order to overcome the drawbacks of standard shuffled frog leaping algorithm that converges slowly at the last stage and easily falls into local minima, this paper proposed two-phases learning shuffled frog leaping algorithm. The modified algorithm added the elite Gaussian learning strategy in the global information exchange phase, updated frog leaping rule and added the learning capability t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/451090